The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
نویسنده
چکیده
We prove that for any class of finite or countable graphs closed under taking subgraphs, and such that every finite graph in the class has a number of edges linearly bounded in terms of the number of vertices, the edge set quantifications can be replaced by vertex set quantifications in Monadic secondorder formulas. This result extends to hypergraphs of bounded rank.
منابع مشابه
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quanti*cations
We consider the class USk of uniformly k-sparse simple graphs, i.e., the class of *nite or countable simple graphs, every *nite subgraph of which has a number of edges bounded by k times the number of vertices. We prove that for each k, every monadic second-order formula (intended to express a graph property) that uses variables denoting sets of edges can be e7ectively translated into a monadic...
متن کاملA Linear-time Recognition Algorithm for P4- a Unique Tree Representation for P4-sparse
7)) algorithm for the 3-clique-width problem. Preprint, 1998. Sha98] A. Sharell. Complexit e Descriptive et l'approximation des fonctions de d enombrement. J. Makowsky and U. Rotics. On the cliquewidth of graphs with few P4's. Linear time solvable optimization problems on certain structured graph families, extended abstract. Cou99] B. Courcelle. The monadic second order logic of graphs, XIV: un...
متن کاملThe Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs
This paper begins an investigation of the monadic second-order logic of graphs and of sets of graphs, using techniques from universal algebra, and the theory of formal languages. (By a graph, we mean a finite directed hyperedge-labelled hypergraph, equipped with a sequence of distinguished vertices.) A survey of this research can be found in Courcelle [ 111. An algebraic structure on the set of...
متن کاملMonadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-width and clique-width. It will review applications to the construction of algorithms, to Graph Theory and to the extension to graphs of Formal Language Theory concepts. We first explain the role of Logic. A graph, eith...
متن کاملFly-automata for checking monadic second-order properties of graphs of bounded tree-width
Every graph property expressible in monadic second-order (MSO) logic, possibly with quantifications over edges, can be checked in linear time on graphs of bounded tree-width, in particular by means of finite automata running on terms denoting tree-decompositions. However, implementing these automata is difficult because of their huge sizes. Fly-automata (FA) are deterministic automata that comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 299 شماره
صفحات -
تاریخ انتشار 2003